Graphs whose acyclic graphoidal covering number is one less than its maximum degree
نویسندگان
چکیده
منابع مشابه
Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded
We determine the maximum number of edges that a claw-free graph can have, when its maximum degree and matching number are bounded. This is a famous problem that has been studied on general graphs, and for which there is a tight bound. The graphs achieving this bound contain in most cases an induced copy of K1,3, the claw, which motivates studying the question on claw-free graphs. Note that on g...
متن کاملDetour Monophonic Graphoidal Covering Number of Corona Product Graph of Some Standard Graphs with the Wheel
A chord of a path $P$ is an edge joining two non-adjacent vertices of $P$. A path $P$ is called a monophonic path if it is a chordless path. A longest $x-y$ monophonic path is called an $x-y$ detour monophonic path. A detour monophonic graphoidal cover of a graph $G$ is a collection $psi_{dm}$ of detour monophonic paths in $G$ such that every vertex of $G$ is an internal vertex of at most on...
متن کاملAcyclic Choosability of Graphs with Small Maximum Degree
A proper vertex coloring of a graph G = (V, E) is acyclic if G contains no bicolored cycle. A graph G is L-list colorable if for a given list assignment L = {L(v) : v ∈ V }, there exists a proper coloring c of G such that c(v) ∈ L(v) for all v ∈ V . If G is L-list colorable for every list assignment with |L(v)| ≥ k for all v ∈ V , then G is said k-choosable. A graph is said to be acyclically k-...
متن کاملAcyclic Vertex Coloring of Graphs of Maximum Degree 4
The acyclic chromatic number of a graph G, denoted a(G), is the minimum number of colors required to properly color the vertices of a graph such that there are no bichromatic cycles. The concept of acyclic coloring of a graph was introduced by [5] and is further studied in the last two decades in several works. Kostochka [6] proves that determining it is an NP-complete problem. Given the comput...
متن کاملAcyclic Vertex Coloring of Graphs of Maximum Degree
An acyclic vertex coloring of a graph is a proper vertex coloring such that there are no bichromatic cycles. The acyclic chromatic number of G, denoted a(G), is the minimum number of colors required for acyclic vertex coloring of graph G = (V,E). For a family F of graphs, the acyclic chromatic number of F , denoted by a(F), is defined as the maximum a(G) over all the graphs G ∈ F . In this pape...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2001
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00350-2